skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Zhang, Xiao-Dong"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, The Electronic Journal of Combinatorics)
    null (Ed.)
    A graph on $2k+1$ vertices consisting of $$k$$ triangles which intersect in exactly one common vertex is called a $k-$friendship graph and denoted by $$F_k$$. This paper determines the graphs of order $$n$$  that have the maximum (adjacency) spectral radius among all graphs containing no $$F_k$$, for $$n$$ sufficiently large. 
    more » « less
    Full Text Available